151 research outputs found
On the Regularity of Optimal Transportation Potentials on Round Spheres
In this paper the regularity of optimal transportation potentials defined on
round spheres is investigated. Specifically, this research generalises the
calculations done by Loeper, where he showed that the strong (A3) condition of
Trudinger and Wang is satisfied on the round sphere, when the cost-function is
the geodesic distance squared. In order to generalise Loeper's calculation to a
broader class of cost-functions, the (A3) condition is reformulated via a
stereographic projection that maps charts of the sphere into Euclidean space.
This reformulation subsequently allows one to verify the (A3) condition for any
case where the cost-fuction of the associated optimal transportation problem
can be expressed as a function of the geodesic distance between points on a
round sphere. With this, several examples of such cost-functions are then
analysed to see whether or not they satisfy this (A3) condition.Comment: 24 pages, 4 figure
Mass transportation with LQ cost functions
We study the optimal transport problem in the Euclidean space where the cost
function is given by the value function associated with a Linear Quadratic
minimization problem. Under appropriate assumptions, we generalize Brenier's
Theorem proving existence and uniqueness of an optimal transport map. In the
controllable case, we show that the optimal transport map has to be the
gradient of a convex function up to a linear change of coordinates. We give
regularity results and also investigate the non-controllable case
Mass Transportation on Sub-Riemannian Manifolds
We study the optimal transport problem in sub-Riemannian manifolds where the
cost function is given by the square of the sub-Riemannian distance. Under
appropriate assumptions, we generalize Brenier-McCann's Theorem proving
existence and uniqueness of the optimal transport map. We show the absolute
continuity property of Wassertein geodesics, and we address the regularity
issue of the optimal map. In particular, we are able to show its approximate
differentiability a.e. in the Heisenberg group (and under some weak assumptions
on the measures the differentiability a.e.), which allows to write a weak form
of the Monge-Amp\`ere equation
Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models
A computation scheme for solving elliptic boundary value problems with
axially symmetric confining potentials using different sets of one-parameter
basis functions is presented. The efficiency of the proposed symbolic-numerical
algorithms implemented in Maple is shown by examples of spheroidal quantum dot
models, for which energy spectra and eigenfunctions versus the spheroid aspect
ratio were calculated within the conventional effective mass approximation.
Critical values of the aspect ratio, at which the discrete spectrum of models
with finite-wall potentials is transformed into a continuous one in strong
dimensional quantization regime, were revealed using the exact and adiabatic
classifications.Comment: 6 figures, Submitted to Proc. of The 12th International Workshop on
Computer Algebra in Scientific Computing (CASC 2010) Tsakhkadzor, Armenia,
September 5 - 12, 201
Approximating a Behavioural Pseudometric without Discount for<br> Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of
behavioural pseudometrics for probabilistic transition systems. These
pseudometrics are a quantitative analogue of probabilistic bisimilarity.
Distance zero captures probabilistic bisimilarity. Each pseudometric has a
discount factor, a real number in the interval (0, 1]. The smaller the discount
factor, the more the future is discounted. If the discount factor is one, then
the future is not discounted at all. Desharnais et al. showed that the
behavioural distances can be calculated up to any desired degree of accuracy if
the discount factor is smaller than one. In this paper, we show that the
distances can also be approximated if the future is not discounted. A key
ingredient of our algorithm is Tarski's decision procedure for the first order
theory over real closed fields. By exploiting the Kantorovich-Rubinstein
duality theorem we can restrict to the existential fragment for which more
efficient decision procedures exist
A user's guide to optimal transport
This text is an expanded version of the lectures given by the first author in the 2009 CIME summer school of Cetraro. It provides a quick and reasonably account of the classical theory of optimal mass transportation and of its more recent developments, including the metric theory of gradient flows, geometric and functional inequalities related to optimal transportation, the first and second order differential calculus in the Wasserstein space and the synthetic theory of metric measure spaces with Ricci curvature bounded from below
Integral potential method for a transmission problem with Lipschitz interface in R^3 for the Stokes and Darcy–Forchheimer–Brinkman PDE systems
The purpose of this paper is to obtain existence and uniqueness results in weighted Sobolev spaces for transmission problems for the non-linear Darcy-Forchheimer-Brinkman system and the linear Stokes system in two complementary Lipschitz domains in R3, one of them is a bounded Lipschitz domain with connected boundary, and the other one is the exterior Lipschitz domain R3 n. We exploit a layer potential method for the Stokes and Brinkman systems combined with a fixed point theorem in order to show the desired existence and uniqueness results, whenever the given data are suitably small in some weighted Sobolev spaces and boundary Sobolev spaces
- …